Tel Aviv University School of Mathematical Science Asymptotic Methods for Queueing Systems and Networks with Application to Telecommunications

نویسندگان

  • Vyacheslav M. Abramov
  • Zeev Schuss
  • Robert Liptser
چکیده

This dissertation is concerned with the study of non-Markovian queueing systems and networks, with applications to communication networks. The main contribution of the dissertation consists in deriving results for non-Markovian networks that have been obtained so far only for Markovian queueing networks. We study large closed client/server communication networks and losses in single-server queueing systems, with an application to communication networks of loss queues. We apply stochastic calculus and the theory of martingales to the case when one of the client stations is a bottleneck in the limit, where the total number of tasks in the server increases to infinity. The main results of this study are (i) an explicit expression for the interrelation between the limiting non-stationary distributions in non-bottleneck client stations; thus when one distribution is found in a simulation, the others can be computed; (ii) derivation of diffusion and fluid approximations for the non-Markovian queue length in the bottleneck client station. For the loss networks considered, we find an asymptotic expression for the loss probability and other performance measures, as buffer capacity increases to infinity. We also find the changes in the loss probability when redundant packets are added to the messages. The application of martingale methods for the study of the asymptotic behavior of non-Markovian queueing systems seems to be new.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anger Modulates Influence Hierarchies Within and Between Emotional Reactivity and Regulation Networks

Sagol School of Neuroscience, Tel Aviv University, Tel Aviv, Israel, Tel Aviv Center for Brain Functions, Wohl Institute for Advanced Imaging, Tel Aviv Sourasky Medical Center, Tel Aviv, Israel, The School of Psychological Sciences, Tel Aviv University, Tel Aviv, Israel, Systems Neuroscience and Pain Laboratory, Department of Anesthesia, Perioperative and Pain Medicine, School of Medicine, Stan...

متن کامل

An ASIP model with general gate opening intervals

We consider an asymmetric inclusion process, which can also be viewed as a model of n queues in series. Each queue has a gate behind it, which can be seen as a server. When a gate opens, all customers in the corresponding queue instantaneously move to the next queue and form a cluster with the customers there. When the nth gate opens, all customers in the nth site leave the system. For the case...

متن کامل

Embedding of biological distribution networks with differing environmental constraints

Lia Papadopoulos, Pablo Blinder, 3 Henrik Ronellenfitsch, Florian Klimm, 5 Eleni Katifori, David Kleinfeld, and Danielle S. Bassett 8 Department of Physics and Astronomy, University of Pennsylvania, Philadelphia, PA 19104, USA Sagol School of Neuroscience, Tel-Aviv University, Tel Aviv 6997801, Israel Neurobiology Department, George S. Wise Faculty of Life Sciences, Tel Aviv University, Tel Avi...

متن کامل

Observation of linear systems with unknown inputs via high-order sliding-modes

International Journal of Systems Science Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713697751 Observation of linear systems with unknown inputs via high-order sliding-modes Leonid Fridman a; Arie Levant b; Jorge Davila a a Engineering Faculty, Department of Control, Division of Electrical Engineering, Nat...

متن کامل

Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes

Let S be a set of n moving points in the plane. We present a kinetic and dynamic (randomized) data structure for maintaining the convex hull of S. The structure uses O(n) space, and processes an expected number of O(nβs+2(n) logn) critical events, each in O(log n) expected time, including O(n) insertions, deletions, and changes in the flight plans of the points. Here s is the maximum number of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004